A Parallel Global Optimization Method for Solving Molecular Cluster and Polymer Conformation Problems

نویسندگان

  • Richard H. Byrd
  • Elizabeth Eskow
  • André van der Hoek
  • Bobby Schnabel
  • Klaas P. B. Oldenkamp
چکیده

Identifying the conformations that a molecular cluster or polymer assumes in nature is an important problem with many practical applications in biology and medicine It is believed that the naturally occurring molecular conformations minimize or nearly minimize the potential energy of the molecular cluster or polymer The problem of nding the molecular con guration s with the lowest potential energy is a challenging global optimization problem with a potentially huge number of local solutions over a very large parameter space We have developed a method to solve these types of problems and have experimented with both molecular cluster and polymer applications with very promising results We have implemented the method on powerful massively parallel computers because of the enormous computational requirements of solving these types of problems The parallel algorithms are interesting asynchronous multi level parallel algorithms

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel continuation-based global optimization for molecular conformation and protein folding

This paper presents our recent work on developing parallel algorithms and software for solving the global minimization problem for molecular conformation, especially protein folding. Global minimization problems are diicult to solve when the objective functions have many local minimizers, such as the energy functions for protein folding. In our approach, to avoid directly minimizing a \diicult"...

متن کامل

Parallelizing Assignment Problem with DNA Strands

Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...

متن کامل

A New Hybrid Flower Pollination Algorithm for Solving Constrained Global Optimization Problems

Global optimization methods play an important role to solve many real-world problems. Flower pollination algorithm (FP) is a new nature-inspired algorithm, based on the characteristics of flowering plants. In this paper, a new hybrid optimization method called hybrid flower pollination algorithm (FPPSO) is proposed. The method combines the standard flower pollination algorithm (FP) with the par...

متن کامل

A FAST GA-BASED METHOD FOR SOLVING TRUSS OPTIMIZATION PROBLEMS

Due to the complex structural issues and increasing number of design variables, a rather fast optimization algorithm to lead to a global swift convergence history without multiple attempts may be of major concern. Genetic Algorithm (GA) includes random numerical technique that is inspired by nature and is used to solve optimization problems. In this study, a novel GA method based on self-a...

متن کامل

Solving the Problem of Scheduling Unrelated Parallel Machines with Limited Access to Jobs

Nowadays, by successful application of on time production concept in other concepts like production management and storage, the need to complete the processing of jobs in their delivery time is considered a key issue in industrial environments. Unrelated parallel machines scheduling is a general mood of classic problems of parallel machines. In some of the applications of unrelated parallel mac...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995